Prolegomena to the Deenition of Dynamic Predicate Logic with Local Assignments
نویسنده
چکیده
In this paper we subject the possible ways to deene versions of DPL with local assignments to a thorough and detailed scrutiny. We hope that our treatment is suggestive of the properàbstract' view of dynamic logics that we would like to arrive at eventually.
منابع مشابه
Prolegomena to the De nition of Dynamic Predicate Logic with Local Assignments
In this paper we subject the possible ways to de ne versions of DPL with local assignments to a thorough and detailed scrutiny We hope that our treatment is suggestive of the proper abstract view of dynamic logics that we would like to arrive at eventually
متن کاملDealing with Multiple Granularity of Time in Temporal Logic Programming
Chronolog(MC) is an extension of logic programming based on a clocked temporal logic (CT L), a linear-time temporal logic with multiple granularity of time. A Chronolog(MC) program consists of a clock deenition, a clock assignment and a program body, and each predicate symbol appearing in the program body is associated with a local clock through the clock deenition and assignment. This paper in...
متن کاملSequence semantics for dynamic predicate logic
In this paper a semantics for dynamic predicate logic is developed that uses sequence valued assignments This semantics is compared with the usual relational semantics for dynamic predicate logic it is shown that the most important intuitions of the usual se mantics are preserved Then it is shown that the re ned semantics re ects out intuitions about information growth Some other issues in dyna...
متن کاملDip. Di Matematica Applicata Ed Informatica Technical Report Series on Computer Science Composing Complete and Partial Knowledge Composing Complete and Partial Knowledge
The representation of knowledge in the logic OLP-FOL 8], 7], is split in two parts: writing deenitions for known concepts, and writing constraints, expressing partial knowledge on other concepts. This is reeected in an OLP-FOL theory T , which is a pair: T = (T d ; T c). The deenition part T d contains the deenitions for known predicates in the form of a normal open logic program (OLP), whereas...
متن کاملModal Foundations for Predicate Logic
The complexity of any logical modeling reeects both the intrinsic structure of a topic described and the weight of the formal tools. Some of this weight seems inherent in even the most basic logical systems. Notably, standard predicate logic is undecidable. In this paper, we investigatèlighter' versions of this general purpose tool, by modally`deconstructing' the usual semantics, and locating i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997